A Tree-Like Model for Brain Growth and Structure

نویسندگان

  • Benjamin C. Yan
  • Johnson F. Yan
چکیده

The Flory-Stockmayer theory for the polycondensation of branched polymers, modified for finite systems beyond the gel point, is applied to the connection (synapses) of neurons, which can be considered highly branched "monomeric" units. Initially, the process is a linear growth and tree-like branching between dendrites and axons of nonself-neurons. After the gel point and at the maximum "tree" size, the tree-like model prescribes, on average, one pair of twin synapses per neuron. About 13% of neurons, "unconnected" to the maximum tree, migrate to the surface to form cortical layers. The number of synapses in each neuron may reach 10000, indicating a tremendous amount of flexible, redundant, and neuroplastic loop-forming linkages which can be preserved or pruned by experience and learning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Optimization Model for Scheduling of a Multi-Product Tree-Like Pipeline

In the petroleum supply chain, oil refined products are often delivered to distribution centers by pipelines since they provide the most reliable and economical mode of transportation over large distances. This paper addresses the optimal scheduling of a complex pipeline network with multiple branching lines. The main challenge is to find the optimal sequence and time of product injections/deli...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

P84: Effect of Insulin-Like Growth Factor 2 (IGF2) as a Microglia-Derived Anti-Iinflammatory Ccytokine on Improving Memory Impairment Following Hippocampal Intracerebral Hemorrhage in Rat

Insulin-like growth factor 2 (IGF2) as a microglia-derived anti-inflammatory cytokine has a pivotal activity in memory consolidation. However, there is limited evidence on brain cell-originated IGF2 expression, regulation and function in pathological condition and neuro-inflammation. Hence, the present study was conducted to investigate the effect of IGF2 on improving the memory impairment in a...

متن کامل

Detailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries

In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013